翻訳と辞書
Words near each other
・ SLC9A6
・ SLC9A8
・ SLC9B2
・ SLCC
・ SLCD (disambiguation)
・ SLCO1A2
・ SLCO1B1
・ SLCO1B3
・ SLCO2A1
・ SLCO2B1
・ SLCO3A1
・ SLCO4A1
・ SLCU
・ SLD
・ SLD Olding
SLD resolution
・ SLDCOM
・ SLE
・ Slea Head
・ Sleaford
・ Sleaford (UK Parliament constituency)
・ Sleaford and North Hykeham (UK Parliament constituency)
・ Sleaford Castle
・ Sleaford Joint Sixth Form
・ Sleaford Mere
・ Sleaford Mere Conservation Park
・ Sleaford Mods
・ Sleaford Navigation
・ Sleaford railway station
・ Sleaford Rural District


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

SLD resolution : ウィキペディア英語版
SLD resolution
SLD resolution (''Selective Linear Definite'' clause resolution) is the basic inference rule used in logic programming. It is a refinement of resolution, which is both sound and refutation complete for Horn clauses.
== The SLD inference rule ==

Given a goal clause:
\neg L_1 \or \cdots \or \neg L_i \or \cdots \or \neg L_n
with selected literal \neg L_i , and an input definite clause:
L \or \neg K_1 \or \cdots \or \neg K_m
whose positive literal (atom) L\, unifies with the atom L_i \, of the selected literal \neg L_i \, , SLD resolution derives another goal clause, in which the selected literal is replaced by the negative literals of the input clause and the unifying substitution \theta \, is applied:
(\neg L_1 \or \cdots \or \neg K_1 \or \cdots \or \neg K_m\ \or \cdots \or \neg L_n)\theta
In the simplest case, in propositional logic, the atoms L_i \, and L \, are identical, and the unifying substitution \theta \, is vacuous. However, in the more general case, the unifying substitution is necessary to make the two literals identical.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「SLD resolution」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.